Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces
نویسندگان
چکیده
Runtime monitoring is a central operational decision support task in business process management. It helps executors to check on-the-fly whether running instance satisfies constraints of interest, providing an immediate feedback when deviations occur. We study runtime properties expressed ltl f , variant the classical (Linear-time Temporal Logic) that interpreted over finite traces, and its extension ldl powerful logic obtained by combining with regular expressions. show able declaratively express, itself, not only be monitored, but also de facto standard rv -LTL monitors. On one hand, this enables us directly employ characterization based on finite-state automata monitor fine-grained way. other it provides basis for expressing sophisticated metaconstraints predicate state constraints, them relying logical services instead ad hoc algorithms. then report how approach has been effectively implemented using Java manipulate formulae their corresponding monitors, RuM rule mining suite as underlying infrastructure.
منابع مشابه
Monitoring Business Metaconstraints Based on LTL & LDL for Finite Traces
Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed in LTL on finite traces (LTLf ) and its extension LDLf . LDLf is a powerful logic that captures all monadic second order logic on finite traces, which is obta...
متن کاملMonitoring Business Metaconstraints Based on LTL and LDL for Finite Traces
Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed in LTL on finite traces (LTLf ) and in its extension LDLf . LDLf is a powerful logic that captures all monadic second order logic on finite traces, which is o...
متن کاملCompleteness for Logics on Finite Traces
Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. We propose that existing methods for proving deductive completeness for infinite-trace logics are effective on their finite counterparts. To adapt proofs for infinite-trace logics, we “inject” finiteness: that is, we alter the proof structure to ensure that models are finite. As evidence for...
متن کاملTemporal Logics with Local Constraints ∗
Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper. 1998 ACM Subject Classification F.4.1 Mathematical Logic
متن کاملLinear Temporal Logic and Linear Dynamic Logic on Finite Traces
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf , i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf interpreted over finite traces. Indeed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Software Engineering and Methodology
سال: 2022
ISSN: ['1049-331X', '1557-7392']
DOI: https://doi.org/10.1145/3506799